Bi-Temporal Indexing
نویسندگان
چکیده
DEFINITION A bi-temporal index is a data structure that supports both temporal time dimensions, namely, transactiontime (the time when a fact is stored in the database) and valid-time (the time when a fact becomes valid in reality). The characteristics of the time dimensions supported imply various properties that the bi-temporal index should have to be efficient. As traditional indices, the performance of a temporal index is described by three costs: (i) storage cost (i.e., the number of pages the index occupies on the disk), (ii) update cost (the number of pages accessed to perform an update on the index; for example when adding, deleting or updating a record), and (iii) query cost (the number of pages accessed for the index to answer a query).
منابع مشابه
Indexing and Query Processing Techniques in Spatio-temporal Data
Indexing and query processing is an emerging research field in spatio temporal data. Most of the real-time applications such as location based services, fleet management, traffic prediction and radio frequency identification and sensor networks are based on spatiotemporal indexing and query processing. All the indexing and query processing applications is any one of the forms, such as spatio in...
متن کاملAn Efficient Strategy for Spatio-temporal Data Indexing and Retrieval
Moving people’s and objects’ trajectories extracted from video sequences are increasingly assuming a key role for detecting anomalous events and for characterizing human behaviors. Among the key related issues, there is the need of efficiently storing a huge amount of 3D trajectories together with retrieval techniques sufficiently fast to allow a real-time extraction of trajectories satisfying ...
متن کاملEfficient Indexing Methods for Temporal Relations
The size of temporal databases and the semantics of temporal queries pose challenges for the design of efhcient indexing methods. The primary issues that affect the design of indexing methods are examined, and propose several structures and algorithms for specific cases. Indexing methods for timebased queries are developed, queries on the surrogate or timeinvariant key and time, and temporal at...
متن کاملHigh-Dimensional Spatio-Temporal Indexing
There exist numerous indexing methods which handle either spatio-temporal or high-dimensional data well. However, those indexing methods which handle spatio-temporal data well have certain drawbacks when confronted with high-dimensional data. As the most efficient spatio-temporal indexing methods are based on the R-tree and its variants, they face the well known problems in high-dimensional spa...
متن کاملAn Efficient Technique for Indexing Temporal Databases
Temporal databases added a new dimension to traditional transaction databases. This dimension is the life time of each item, i.e. exhibition period, starting from the partition when this item appears in the transaction database to the partition when this item no longer exists. Mining temporal association rules became very interesting topic in many applications nowadays. In this paper, an effici...
متن کامل